Some Complexity Results for Distance-Based Judgment Aggregation
نویسندگان
چکیده
Judgment aggregation is a social choice method for aggregating information on logically related issues. In distance-based judgment aggregation, the collective opinion is sought as a compromise that satisfies several structural properties. It would seem that the standard conditions on distance and aggregation functions are strong enough to guarantee existence of feasible procedures. In this paper, we show that it is not the case, though the problem becomes easier under some additional assumptions.
منابع مشابه
Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures
Judgment aggregation is an abstract framework for studying collective decision making by aggregating individual opinions on logically related issues. Important types of judgment aggregation methods are those of scoring and distance-based methods, many of which can be seen as generalisations of voting rules. An important question to investigate for judgment aggregation methods is how hard it is ...
متن کاملComplexity of Manipulative Attacks in Judgment Aggregation for Premise-Based Quota Rules1
Endriss et al. [26] initiated the complexity-theoretic study of problems related to judgment aggregation. We extend their results for manipulating two specific judgment aggregation procedures to a whole class of such procedures, namely to uniform premise-based quota rules. In addition, we consider incomplete judgment sets and the notions of top-respecting and closeness-respecting preferences in...
متن کاملParameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
We investigate the parameterized complexity of computing an outcome of the Kemeny rule in judgment aggregation, providing the first parameterized complexity results for this problem for any judgment aggregation procedure. As parameters, we consider (i) the number of issues, (ii) the maximum size of formulas used to represent issues, (iii) the size of the integrity constraint used to restrict th...
متن کاملComplexity of Judgment Aggregation
We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whet...
متن کاملDistance-Based Judgment Aggregation of Three-Valued Judgments with Weights
Judgment aggregation theory studies how to amalgamate individual opinions on a set of logically related issues into a set of collective opinions. Aggregation rules proposed in the literature are sparse. All proposed rules consider only two-valued judgments, thus imposing the strong requirement that an agent cannot abstain from giving judgments on any of the issues. All proposed rules are also i...
متن کامل